Weinbaum Factorizations of Primitive Words
نویسندگان
چکیده
C. M. Weinbaum [Proc.AMS, 109(3):615–619, 1990] showed the following: Let w be a primitive word and a be letter in w. Then a conjugate of w can be written as uv such that a is a prefix and a suffix of u, but v neither starts nor ends with a, and u and v have a unique position in w as cyclic factors. The latter condition means that there is exactly one conjugate of w having u as a prefix and there is exactly one conjugate of w having v as a prefix. It is this condition which makes the result non-trivial. We give a simplified proof for Weinbaum’s result. Guided by this proof we exhibit quite different, but still simple, proofs for more general statements. For this purpose we introduce the notion of Weinbaum factor and Weinbaum factorization.
منابع مشابه
On unique factorizations of primitive words
We give a short proof of a result by C. M. Weinbaum [Proc. AMS, 109(3):615–619, 1990] stating that each a primitive word of length at least 2 has a conjugate w′ = uv such that both u and v have a unique position in the cyclic word of w.
متن کاملFactorizations of Cyclic Words
Weinbaum [Proc.AMS, 109(3):615–619, 1990] showed that for each letter a in a primitive word w, there exists a conjugate w = uv of w such that both u and v are uniquely positioned in the cyclic word w such that u begins and ends with a and v neither begins nor ends with a. We give a generalization of this result using iterative methods.
متن کاملOn Defect Eeect of Bi-innnite Words
We prove the following two variants of the defect theorem. Let X be a nite set of words over a nite alphabet. Then if a nonperiodic bi-in nite word w has two X-factorizations, then the combinatorial rank of X is at most card(X) 1, i.e. there exists a set F such that X F+ with card(F ) < card(X). Further, if card(X) = 2 and a bi-in nite word possesses two X-factorizations which are not shift-equ...
متن کاملOn z-factorization and c-factorization of standard episturmian words
Ziv-Lempel and Crochemore factorization are two kinds of factorizations of words related to text processing. In this paper, we find these factorizations for standard epiesturmian words. Thus the previously known c-factorization of standard Sturmian words is provided as a special case. Moreover, the two factorizations are compared.
متن کاملUnitary Matrix Integrals, Primitive Factorizations, and Jucys-Murphy Elements
A factorization of a permutation into transpositions is called “primitive” if its factors are weakly ordered. We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously studied factorization problems. Several formulas enumerating minimal primitive and possibly non-minimal primitive factorizations are presented, and interesting co...
متن کامل